A Life ' s Work on Hadamard Matrices ,
نویسنده
چکیده
1 Hadamard matrices in Space Communications One hundred years ago, in 1893, Jacques Hadamard 21] found square matrices of orders 12 and 20, with entries 1, which had all their rows (and columns) orthogonal. These matrices, X = (x ij), satissed the equality of the following inequality jdet Xj 2 n i=1 n X j=1 jx ij j 2 and had maximal determinant. Hadamard actually asked the question of matrices with entries on the unit disc but his name has become associated with the real matrices. Hadamard was not the rst to study these matrices for J.J. Sylvester in 1857 in his seminal paper \Thoughts on inverse orthogonal matrices, simultaneous sign-successions and tessellated pavements in two or more colours with application to Newton's rule, ornamental tile work and the theory of numbers" 55] had found such matrices for all orders which are powers of two. Nevertheless, Hadamard showed matrices with elements 1 and maximal determinant could exist for all orders 1, 2, and 4t and so the Hadamard conjecture \that there exists an Hadamard matrix, or square matrix with every element 1 and all row (column) vectors orthogonal" came from here. The survey by J. Seberry and M. Yamada 51] indicates the progress that has been made in the past 100 years. Hadamard's inequality applies to matrices from the unit circle and matrices with entries 1; i and pairwise orthogonal rows (and columns) are called complex Hadamard matrices (note the scalar product is a:b = P a i b i for complex numbers). These matrices were rst studied by R.J. Turyn 58]. We believe complex Hadamard matrices exist for every order n 0 (mod 2).
منابع مشابه
The cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. This represents a significant extension and completion of work by de Launey and Ito. The theory of cocyclic development is discussed, and an algorithm for determining whether a given Hadamard matrix is cocyclic is describe...
متن کاملThe Quaternary Complex Hadamard Conjecture of order 2 n
ABSTRACT: In this paper, a complete construction of quaternary complex Hadamard matrices of order 2 n is obtained using the method of Sylvester construction and Williamson construction. Williamson construction has been generalized to obtain any kind of Hadamard matrices (Complex or Real Numbers). Non-equivalent family of Hadamard Matrices can be obtained using the Generalized Williamson constru...
متن کاملWeak log-majorization inequalities of singular values between normal matrices and their absolute values
This paper presents two main results that the singular values of the Hadamard product of normal matrices $A_i$ are weakly log-majorized by the singular values of the Hadamard product of $|A_{i}|$ and the singular values of the sum of normal matrices $A_i$ are weakly log-majorized by the singular values of the sum of $|A_{i}|$. Some applications to these inequalities are also given. In addi...
متن کاملDifference sets and doubly transitive actions on Hadamard matrices
Non-affine groups acting doubly transitively on a Hadamard matrix have been classified by Ito. Implicit in this work is a list of Hadamard matrices with non-affine doubly transitive automorphism group. We give this list explicitly, in the process settling an old research problem of Ito and Leon. We then use our classification to show that the only cocyclic Hadamard matrices developed form a dif...
متن کاملUnified Particle Swarm Optimization for Hadamard matrices of Williamson type
In this work we apply the recently proposed Unified Particle Swarm Optimization (UPSO) method to the search for Hadamard matrices of the Williamson type. The objective functions that arise from the classical Williamson construction, are ideally suited for UPSO algorithms. This is the first time that swarm intelligence methods are applied to this problem. Mathematics Subject Classification (2000...
متن کامل